Constructing Higher Inductive Types as Groupoid Quotients

نویسندگان

چکیده

In this paper, we study finitary 1-truncated higher inductive types (HITs) in homotopy type theory. We start by showing that all these can be constructed from the groupoid quotient. define an internal notion of signatures for HITs, and each signature, construct a bicategory algebras 1-types groupoids. continue proving initial algebra semantics our signatures. After that, show quotient induces biadjunction between bicategories Then biinitial object groupoids, which gives desired algebra. From this, conclude HITs present several examples are definable using signature. particular, signature rise to HIT corresponding freely generated algebraic structure over it. also development universal 1-types. has PIE limits, i.e. products, inserters equifiers, prove version first isomorphism theorem Finally, give alternative characterization foundamental groups some exploiting construction via All results formalized UniMath library univalent mathematics Coq.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Syntax for Higher Inductive-Inductive Types∗

Higher inductive-inductive types (HIITs) generalise inductive types of dependent type theories in two directions. On the one hand they allow the simultaneous definition of multiple sorts that can be indexed over each other. On the other hand they support equality constructors, thus generalising higher inductive types of homotopy type theory. Examples that make use of both features are the Cauch...

متن کامل

Higher Inductive Types in Programming

We propose general rules for higher inductive types with non-dependent and dependent elimination rules. These can be used to give a formal treatment of data types with laws as has been discussed by David Turner in his earliest papers on Miranda [Turner(1985)]. The non-dependent elimination scheme is particularly useful for defining functions by recursion and pattern matching, while the dependen...

متن کامل

Computational Higher Type Theory IV: Inductive Types

This is the fourth in a series of papers extending Martin-Löf’s meaning explanation of dependent type theory to higher-dimensional types. In this installment, we show how to define cubical type systems supporting a general schema of cubical inductive types, inductive types whose constructors may take dimension parameters and may have specified boundaries. Using this schema, we are able to speci...

متن کامل

Impredicative Encodings of (Higher) Inductive Types

Postulating an impredicative universe in dependent type theory allows System F style encodings of finitary inductive types, but these fail to satisfy the relevant η-equalities and consequently do not admit dependent eliminators. To recover η and dependent elimination, we present a method to construct refinements of these impredicative encodings, using ideas from homotopy type theory. We then ex...

متن کامل

Higher Inductive Types in Homotopy Type Theory

Homotopy Type Theory (HoTT) refers to the homotopical interpretation [1] of Martin-Löf’s intensional, constructive type theory (MLTT) [5], together with several new principles motivated by that interpretation. Voevodsky’s Univalent Foundations program [6] is a conception for a new foundation for mathematics, based on HoTT and implemented in a proof assistant like Coq [2]. Among the new principl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logical Methods in Computer Science

سال: 2021

ISSN: ['1860-5974']

DOI: https://doi.org/10.23638/lmcs-17(2:8)2021